Waiting Time Variance in Polling Systems

نویسندگان

  • Saifallah Benjaafar
  • Mehdi Sheikhzadeh
چکیده

In this paper, we develop a general expression for the second moment of waiting time for polling systems with either an exhaustive or gated service policy. We obtain a closed form expression for the second moment of waiting time for the special case of systems with two identical stations. This result is used to show that the behavior of the first two moments can be very different. Specifically, we show that while the expected waiting time is always smaller under the exhaustive policy, the same does not hold for waiting time variance. In fact, we characterize conditions for which the waiting time variance under the exhaustive policy is infinitely larger than the variance under the gated policy. For systems with more than two stations, we present computational results to extend these conclusions. We use these results to show that the difference in waiting time variance between the two policies is not monotonic in the number of stations. For asymmetric systems, we also show that the gated policy can have, for certain stations, both a smaller mean and variance of waiting time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

When Does Forced Idle Time Improve Performance in Polling Models?

Sarkar and Zangwill (1991) showed by numerical examples that reduction in setup times can, surprisingly, actually increase work in process in some cyclic production systems (that is, reduction in switchover times can increase waiting times in some polling models). We present, for polling models with exhaustive and gated service disciplines, some explicit formulas that provide additional insight...

متن کامل

Evaluation and optimization of polling systems

Throughout this internship report, polling systems play a central role. Polling systems are queueing systems consisting of multiple queues, attended by a single server. The server can only serve one queue at a time. Whenever the server moves from one queue to another, a stochastic, non-zero switch-over time is incurred. The server never idles; even when there are no customers waiting in the who...

متن کامل

Closed-Form Waiting Time Approximations for Polling Systems

A typical polling system consists of a number of queues, attended by a single server in a fixed order. The vast majority of papers on polling systems focusses on Poisson arrivals, whereas very few results are available for general arrivals. The current study is the first one presenting simple closed-form approximations for the mean waiting times in polling systems with renewal arrival processes...

متن کامل

Response-time Approximations for Multi-server, Multi-class Production Systems with Significant Setups

A multi-server polling model is a queueing model where many order classes share a set of identical servers and a setup time is incurred whenever a server changes class. This paper develops approximations for the waiting time distribution in a multi-server polling model with cyclic serve-to-exhaustion service. These approximations are derived using previously established heavy-traac results and ...

متن کامل

Waiting-time distributions in polling systems with non-FCFS service policies

Throughout this report, polling systems play a central role. Polling systems are queueing systems consisting of multiple queues, attended by a single server. The server can only serve one queue at a time. Whenever the server moves from one queue to another, a stochastic, non-zero switch-over time is incurred. The server never idles; even when there are no customers waiting in the system, the se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997